Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats

نویسندگان

  • Michael Espig
  • Wolfgang Hackbusch
  • Alexander Litvinenko
  • Hermann G. Matthies
  • Philipp Wähnert
چکیده

In this article we describe an efficient approximation of the stochastic Galerkin matrix which stems from a stationary diffusion equation. The uncertain permeability coefficient is assumed to be a log-normal random field with given covariance and mean functions. The approximation is done in the canonical tensor format and then compared numerically with the tensor train and hierarchical tensor formats. It will be shown that under additional assumptions the approximation error depends only on the smoothness of the covariance function and does not depend either on the number of random variables nor the degree of the multivariate Hermite polynomials.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tensor-Structured Galerkin Approximation of Parametric and Stochastic Elliptic PDEs

We investigate the convergence rate of approximations by finite sums of rank-1 tensors of solutions of multi-parametric elliptic PDEs. Such PDEs arise, for example, in the parametric, deterministic reformulation of elliptic PDEs with random field inputs, based for example, on the M -term truncated Karhunen-Loève expansion. Our approach could be regarded as either a class of compressed approxima...

متن کامل

A Preconditioned Low-Rank Projection Method with a Rank-Reduction Scheme for Stochastic Partial Differential Equations

In this study, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations (PDEs). We propose an iterative algorithm that exploits the Kronecker product structure of the linear systems. The proposed algorithm efficiently approximates the solutions in low-rank tensor format. Using standard ...

متن کامل

Adaptive stochastic Galerkin FEM with hierarchical tensor representations

The solution of PDE with stochastic data commonly leads to very high-dimensional algebraic problems, e.g. when multiplicative noise is present. The Stochastic Galerkin FEM considered in this paper then suffers from the curse of dimensionality. This is directly related to the number of random variables required for an adequate representation of the random fields included in the PDE. With the pre...

متن کامل

Block-Diagonal Preconditioning for Optimal Control Problems Constrained by PDEs with Uncertain Inputs

This paper is aimed at the efficient numerical simulation of optimization problems governed by either steady-state or unsteady partial differential equations involving random coefficients. This class of problems often leads to prohibitively high dimensional saddle point systems with tensor product structure, especially when discretized with the stochastic Galerkin finite element method. Here, w...

متن کامل

Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors

We extend results on the dynamical low-rank approximation for the treatment of time-dependent matrices and tensors (Koch & Lubich, 2007 and 2010) to the recently proposed Hierarchical Tucker tensor format (HT, Hackbusch & Kühn, 2009) and the Tensor Train format (TT, Oseledets, 2011), which are closely related to tensor decomposition methods used in quantum physics and chemistry. In this dynamic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computers & Mathematics with Applications

دوره 67  شماره 

صفحات  -

تاریخ انتشار 2014